Polyadic Concept Analysis
نویسنده
چکیده
The framework and the basic results of Wille on triadic concept analysis, including his Basic Theorem of Triadic Concept Analysis, are here generalized to n-dimensional formal contexts. Mathematics Subject Classifications (2000): Primary: 06A23; secondary: 62-07.
منابع مشابه
n-closure systems and n-closure operators
It is very well known and permeating the whole of mathematics that a closure operator on a given set gives rise to a closure system, whose constituent sets form a complete lattice under inclusion, and vice-versa. Recent work of Wille on triadic concept analysis and subsequent work by the author on polyadic concept analysis led to the introduction of complete trilattices and complete n-lattices,...
متن کاملOn Automorphisms of Polyadic Algebras
Introduction. This paper belongs to the theory of polyadic algebras as developed by Haimos [11-15], but it has a bearing on the theory of models. Two central concepts are those of homogeneous(2) and of normal extensions of a polyadic algebra (see the beginning of §2 and of §6). These concepts bear some resemblance to concepts of the theory of algebraic extensions of fields; however, we have bee...
متن کاملDedekind-MacNeille Completion of n-Lattices
A completion of an n-lattice L = 〈L,.1, . . . , .n〉 is defined, by analogy with lattices, as a pair 〈e,C〉, where C is a complete n-lattice and e : L → C is an n-lattice embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary n-lattice. The completion reduces to the Dedekind-MacNeille completion in the dyadic case, which was first formulat...
متن کاملSahlqvist Formulas in Hybrid Polyadic Modal Logics
Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [10] we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the...
متن کاملAlgebraic Logic Iv. Equality in Polyadic Algebras
Introduction. A standard way to begin the study of symbolic logic is to describe one after another the propositional calculus, the monadic functional calculus, the pure first-order functional calculus, and the functional calculus with equality. The algebraic aspects of these logical calculi belong to the theories of Boolean algebras, monadic algebras, polyadic algebras, and cylindric algebras r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 19 شماره
صفحات -
تاریخ انتشار 2002